Odd minimum cut sets and b-matchings revisited
نویسندگان
چکیده
The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time in the uncapacitated case, and in O(|V ||E|2 log (|V |2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time.
منابع مشابه
Complete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملAlternating paths revisited II: restricted b-matchings in bipartite graphs
We give a constructive proof for a min-max relation on restricted b-matchings in bipartite graphs, extending results of Hartvigsen [5, 6], Király [7], and Frank [3]. Restricted b-matching is a special case of covering pairs of sets, for which Benczúr and Végh [1, 2] constructed a polynomial time algorithm – this implies a polynomial time algorithm for restricted b-matchings, as well. In this pa...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملFast Algorithms for Even/Odd Minimum Cuts and Generalizations
We give algorithms for the directed minimum odd or even cut problem and certain generalizations. Our algorithms improve on the previous best ones of Goemans and Ramakrishnan by a factor of O(n) (here n is the size of the ground vertex set). Our improvements apply among others to the minimum directed Todd or T-even cut and to the directed minimum Steiner cut problems. The (slightly more general)...
متن کاملUndirected distances and the postman-structure of graphs
We present some properties of the distance function and of shortest paths in + l-weighted undirected graphs. These extend some basic results, e.g., on matchings, on the Chinese postman problem, and on plane multicommodity flows. Furthermore, distances turn out to be efficient tools to generalize the matching-structure of graphs to a structure related to subgraphs having only parity constraints ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 22 شماره
صفحات -
تاریخ انتشار 2008